Aim

The aim of Binary Search is to efficiently locate a specific element in a sorted list by repeatedly dividing the search interval in half.